Discussiones Mathematicae Lattice-like Total Perfect Codes Contribution Covers All Possible Cases. a Related Conjecture on the Unfinished Work on Open Problems on Lattice-like Perfect Dominating Sets in Λ N With
نویسندگان
چکیده
13 A contribution is made to the classification of lattice-like total perfect 14 codes in integer lattices Λn via pairs (G,Φ) formed by abelian groups G 15 and homomorphisms Φ : Z → G. A conjecture is posed that the cited 16 contribution covers all possible cases. A related conjecture on the unfinished 17 work on open problems on lattice-like perfect dominating sets in Λn with 18 induced components that are parallel paths of length > 1 is posed as well. 19
منابع مشابه
Lattice-like Total Perfect Codes
A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G,Φ) formed by abelian groups G and homomorphisms Φ : Z → G. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in Λn with induced components that are para...
متن کاملPerfect domination in rectangular grid graphs
A dominating set S in a graph G is said to be perfect if every vertex of G not in S is adjacent to just one vertex of S. Given a vertex subset S of a side Pm of an m×n grid graph G, the perfect dominating sets S in G with S = S ∩ V (Pm) can be determined via an exhaustive algorithm Θ of running time O(2m+n). Extending Θ to infinite grid graphs of width m − 1, periodicity makes the binary decisi...
متن کاملPerfect domination in regular grid graphs
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph Λ of R. In contrast, there is just one 1-perfect code in Λ and one total perfect code in Λ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products Cm × Cn with parallel total perfect codes, and the d-...
متن کاملQuasiperfect domination in triangular lattices
A vertex subset S of a graph G is a perfect (resp. quasiperfect) dominating set in G if each vertex v of G \ S is adjacent to only one vertex (dv ∈ {1, 2} vertices) of S. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schläfli symbol {3, 6} and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of thei...
متن کاملDifference Sets and Codes in $ A_n $ Lattices
This paper presents a geometric/coding theoretic interpretation of planar difference sets and the corresponding reformulations of two important conjectures in the field. It is shown that such sets of order n exist if and only if theAn lattice admits a lattice tiling by balls of radius 2 under l1 metric (i.e., a linear 2-perfect code). More general difference sets and perfect codes of larger rad...
متن کامل